Relations between average distance, heterogeneity and network synchronizability

Relations between Renyi Distance and Fisher Information

In this paper, we first show that Renyi distance between any member of a parametric family and its perturbations, is proportional to its Fisher information. We, then, prove some relations between the Renyi distance of two distributions and the Fisher information of their exponentially twisted family of densities. Finally, we show that the partial ordering of families induced by Renyi dis...

On Approximating the Average Distance Between

Analysis and Control of Network Synchronizability *

In this paper, the investigation is first motivated by showing two examples of simple regular symmetrical graphs, which have the same structural parameters, such as average distance, degree distribution and node betweenness centrality, but have very different synchronizabilities. This demonstrates the complexity of the network synchronizability problem. For a given network with identical node d...

Relations between fusion cross sections and average angular momenta.

We study the relations between moments of fusion cross sections and averages of angular momentum. The role of the centrifugal barrier and the target deformation in determining the eeective barrier radius are clariied. A simple method for extracting average angular momentum from fusion cross sections is demonstrated using numerical examples as well as actual data.

Relation between Randić Index and Average Distance of Trees

The Randić index R(G) of a graph G is the sum of weights (deg(u) deg(v))−0.5 over all edges uv of G, where deg(v) denotes the degree of a vertex v. We prove that for any tree T with n1 leaves R(T ) ≥ ad(T ) + max(0,n1 − 2), where ad(T ) is the average distance between vertices of T . As a consequence we resolve the conjecture R(G) ≥ ad(G) given by Fajtlowicz in 1988 for the case when G is a tree.